Visualizing data center inventory and entity relationships

ABSTRACT

A system can provide a visual representation of an inventory of data entities for a distributed computing system. Inventory data including cost and operational data for data entities such as data centers, servers, and virtual machines, can be converted into a format file. The format file can be used to create a tree of nodes and node summaries corresponding to the data entities. A user interface can display hierarchical and isolated views of the tree revealing parent child relationships between data entities within a computing system infrastructure. Node summaries including cost and utilization data can be displayed to reveal how specific sub-costs such as labor and licensing, are driven by data entities in one level of the infrastructure and pushed to respective parent or child data entities in other levels. Views of the tree can be used to determine areas of inefficiency or reduced value within the computing system.

BACKGROUND

Enterprises commonly utilize distributed computing systems to supportenterprise-level management, communications, data storage, andapplications. A distributed computing system that shares dataprocessing, memory, storage, and other computing resources across anenterprise can be provided by an infrastructure of networked dataentities. Example data entities can include data-storage systems,communications routers, network appliances, tablet computers, mobiletelephones, as well as physical and virtualized computers, servers,server clusters, and data centers. Virtualized data entities can beprovided through cloud-based computing services.

An infrastructure for a large distributed system can include aninventory of data entities interconnected by local networks, wide-areanetworks, wireless communications, and the Internet. Data entities canbe connected in parent-child relationships that collectively define ahierarchy of an infrastructure. For example, data centers can supportservers that support and manage groups of remote computers or virtualmachines used by end-users. Public or private clouds can make up partsof an infrastructure and expand it by instantiating virtualized machinesat different levels of a respective hierarchy. Further, clouds can beused to shift allocated computing resources between data entities andlevels of the hierarchy.

Enterprises need to know resource utilizations and costs to maximize theefficiency and reduce the cost of their computing systems. Because ofcomplexity of cloud-based datacenters, these can be complicateddeterminations. Relationships between the many data entities are oftencomplex. Additionally, the cost of a particular data entity can includesub-costs for storage, memory, processing power, hardware, labor, andlicensing. Some sub-costs for a data entity can actually originate fromother related data entities.

Tracking utilizations and sub-costs for large distributed computingsystems can require substantial time and resources. A bottom up accrualor a top down distribution calculation may be required to determine thatsub-cost for a particular data entity. For example, in a hierarchy witha data center that supports several servers that each support a group ofVMs, licensing of software may only occur on the VM-level. Therefore,licensing costs for the data center can be calculated bottom up bysumming licensing costs of the VMs for each server, then summing thetotals of the servers. On the other hand, the cost to provide a singleVM must include top down costs. For example, VM costs necessarilyinclude a portion of labor performed at the data center level.Accordingly, a top down cost distribution for the VM can include a laborcost for the data center divided by the number of servers it supports,divided by the number of VMs supported by a server supporting the VM inquestion.

Current systems do not present this information in a manner that allowsan administrator to appreciate how data entities are interconnected andpinpoint what drives particular costs at different levels of ahierarchy. Instead, enterprises are left to solve these problems basedon a collection of separate reports with isolated utilization and costparameters. As a result, many enterprises struggle to form a completepicture of where sub-costs originate or how they are distributed betweenlevels of a data center hierarchy. This leads to significant costs forthe enterprise and inefficient data center infrastructure.

Therefore, a need exists for systems and methods that visualize datacenter costs and data entity hierarchies. A need also exists for animproved graphical user interface that can display how resourceutilizations and costs are distributed in a data center hierarchy.

SUMMARY

Examples described herein include systems and methods for visualizing aninventory of data entities (“inventory”). In one example, inventory dataincluding cost and utilization data for data entities of aninfrastructure can be converted into a format file. For example,operational and cost data collected and calculated by a backendfinancial service can be encoded in the format file into aself-describing language such as XML, HTML, or JSON by an inventory dataservice of the backend. The format file can be used by to create a treestructure (“tree”) of nodes that correspond to the data entities, and topopulate corresponding node summaries with inventory data.

In one example, the tree can be provided to a User Interface (“UI”),which in turn can display a first view of the inventory. The first viewcan include a hierarchical view of the inventory, which includes aportion of the tree and a first inventory summary. The tree can modelthe interconnections between data entities in the infrastructure. As aresult, in one example, the hierarchical view can show the data entitiesarranged in levels of a hierarchy. The hierarchical view can alsoillustrate parent child relationships between data entities to show howcertain data entities support or are supported by other data entities inthe infrastructure.

A review pane of the UI can display the first inventory summarycontemporaneously with at least one data entity displayed in thehierarchical view. The first inventory summary can include at least onenode summary corresponding to a displayed data entity. The node summarycan include cost and utilization data. Further, the node summary canhave multiple cost or utilization components and cost flow componentsthat reveal which data entities drive particular costs. In anotherexample, the node summaries can indicate a status of a data entity asactive, idle, or deleted. In another example, the status can correspondto a status associated with a majority of child data entities of aselected node (representing a parent data entity).

In one example, nodes displayed in a UI can be selected in multipleways. In one example, a first type of selection causes children nodes toexpand from the selected node and reveal supported data entities in anupdated hierarchical view of the inventory. A selected parent node canbe connected to its children nodes by a link. In one example, each ofthe children nodes can be connected to the parent node by an edge of thelink. Edge sizes or colors can indicate relative values forcharacteristics of the children nodes. For example, the edges can besized in proportion to cost so that in a group of children dataentities, the higher costing data entities will have thicker edgesrelative to the lower costing data entities. Accordingly, a user cancompare cost between data entities through a single view of the UI.

In another example, a second type of node selection can be performed.For the second selection type, node summaries for the selected node andits ancestor nodes can be displayed within the tree and in a reviewpane. A second inventory summary can be used to view node summaries inisolation and within a context of a line of data entities. This canallow a user to glean how one data entity contributes to a trackedparameter for a supporting entity in a single view.

In another example, the UI can include a search field that can be usedto enter a search query for a data entity in the infrastructure. In oneexample, the user can select a search result from a single result or alist of results. The UI can display a second view of the inventoryincluding an isolated view of the tree and a first inventory summarycorresponding to the selected search result. This isolated view caninclude a string of nodes including a node for a selected data entitycorresponding to the search result selection. The node for the selecteddata entity can be displayed at the end of the string of nodes. Thedisplayed string of nodes can represent data entities that support theselected data entity. The nodes can be arranged in an ancestral order,such that the children nodes that link to the selected data entity aredisplayed for the ancestor nodes. In one example, where selected dataentity supports other data entities, a first type of node selection canbe executed and children nodes can be expanded in the isolated view fromthe node for the selected data entity.

Both the foregoing general description and the following detaileddescription are exemplary and explanatory only and are not restrictiveof the examples, as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart of an exemplary method for visualizing aninventory of data entities.

FIG. 2 is a sequence diagram of an exemplary method for visualizing aninventory of data entities.

FIG. 3 is a sequence diagram of an exemplary method for searching for adata entity with a UI.

FIG. 4 is an exemplary illustration of system components for visualizingan inventory of data entities.

FIGS. 5A and 5B illustrate an exemplary UI for visualizing an inventoryof data entities.

FIGS. 6A and 6B are illustrations of an exemplary UI displaying one typeof an inventory summary.

FIG. 7 is an illustration of an exemplary UI including a search resultfor a directed data entity search.

FIG. 8A is an illustration of an exemplary UI for a menu-based dataentity search.

FIG. 8B is an illustration of an exemplary UI including a search resultfor a menu-based data entity search.

DESCRIPTION OF THE EXAMPLES

Reference will now be made in detail to the present examples, includingexamples illustrated in the accompanying drawings. Wherever possible,the same reference numbers will be used throughout the drawings to referto the same or like parts.

Examples described herein include systems and methods for visualizing aninventory of data entities for an infrastructure of a computing system.Inventory data including cost and utilization data for the data entitiescan be converted into a format file and the format file can be appliedto a framework. Application of the format file can create a tree ofnodes that correspond to the data entities, and node summaries withcorresponding inventory data. The tree can be provided to a UserInterface (UI) which in turn can display a first view of the inventorythat includes a hierarchical view and a first inventory view. Thehierarchical view can include a portion of the tree and revealinterconnections between data entities within a structure of ahierarchy. The first inventory summary can include a node summary in areview pane of a UI for a displayed data entity.

The user can make selections on the UI to expand and collapse the treestructure to focus on different levels or nodes. Contemporaneouslydisplayed node summaries can update accordingly to correspond to aselected portion of the tree. A first type of node selection can expandchildren nodes from parent nodes to view more portions of the tree. Asecond type of node selection causes node summaries for a selected nodeand its ancestors to display in the tree and the review pane. The nodesummaries can include a total cost for a data entity and sub-costs, forexample, for memory and storage. Utilization data regarding the dataentity's usage of certain computing resources can be included also. Thenode summaries can include cost flow components that show where aparticular sub-cost comes from in a hierarchy relative to a data entityfor the selected node.

FIG. 1 provides a flowchart of an example method for visualizing aninventory of data entities and obtaining data entity specific cost orutilization data. FIG. 2 provides a more detailed sequence diagram forthe method of visualizing an inventory of FIG. 1. FIG. 3 provides adetailed sequence diagram for using a UI to search for a data entitywithin an inventory and obtain respective cost or utilization data. FIG.4 provides an illustration of an example system for performing themethods of FIGS. 1-4. FIGS. 5A and 5B provide illustrations of anexemplary UI displaying a first view of an inventory that includes ahierarchical view of the inventory and a first inventory summary. FIGS.6A and 6B provide illustrations of an exemplary UI in which an option toview a second inventory summary for different specific data entities hasbeen selected. FIG. 7 provides an illustration of an exemplary UIdisplaying a second view of an inventory subsequent to an execution of adirected entity search. FIGS. 8A and 8B provide illustrations of anexemplary UI before and after a menu-based entity search has beenexecuted.

Turning to the flowchart of FIG. 1, stage 110 includes convertinginventory data into a format file. The inventory data can include costand utilization data for an inventory of data entities (“inventory”). Aninventory encompasses interconnected data entities that make up aninfrastructure of a computing system. Portions of the infrastructure canbe provided by a cloud computing system and exist in a private or publiccloud. In one example, an inventory can include one or more managementservers, data centers, clusters, servers, and user devices or virtualmachines (“VM” or “VMs”) implemented on user devices.

A VM can be a virtualization of a physical computing system or device.For example, the VM can be configured to simulate an embedded operatingsystem that supports multiple applications. In one example, a VM is avirtualization of a user device such as a laptop, a mobile device, orother computing device. In another example, a VM can be a virtualizationof a server or a data center. Any of the data entities in an inventorycan be interchanged with network or storage components incorporatedwithin a hierarchy of an infrastructure.

The inventory data can include operational information regarding thephysical or virtual data entities of a respective entity inventory. Withrespect to servers or VMs, for example, the inventory data can includenames and locations, physical hardware if applicable, current andhistorical loads, installed software, the number of VMs running on eachserver, OS type, OS license type, and software specifications for eachserver. The inventory data can include information defining how dataentities are interconnected. For example, inventory data for a servercan identify a cluster the server is grouped in and the VMs the servermaintains.

The inventory data can further include storage and memory allocationdata and an indication of operational status for each data entity. Inone example, a status for a data entity can be active, idle, or deleted.Using VMs as an example, an active status can include a VM that iscurrently being implemented on a user device and operating in a normalstate. An idle status can correspond to a VM that is being activelymaintained on a server but not currently being implemented on a userdevice. A deleted status can correspond to a VM that has been deleted,is marked for deletion, or persists in a state on a server from which itmust be restored.

The cost and utilization data included in the inventory data caninclude, but is not limited to, hardware cost, OS and other softwarelicensing costs, memory costs, storage costs, labor costs to install,repair, and maintain servers, and facility costs such as rent, realestate, power, and cooling. The cost and utilization data can alsoinclude allocation percentages for memory, storage, and processing powerwith respect to total allocations for groups of VMs, servers, andclusters. In one example, the utilization data can further includepercent usage of individual data entity allocations for storage, memory,and processing power.

The inventory data can be obtained and converted by backend services ofa management platform. In one example, a backend financial service cancollect operational data and compute costs. Examples of financialservices include VMWARE VREALIZE Business (“vRB”) and VREALIZE Businessfor clouds (“vRBC”), as well as others. These services can take inputfrom a VCENTER, VREALIZE Automation, or VCLOUD Director deployed by anadministrator for managing a respective environment. In one example, vRBand vRBC can inventory structure information from VREALIZE Operations,along with VM and storage utilizations. The data center inventorystructure can include servers, clusters, VM, storage details, etc. Inaddition, the VM and storage utilizations can be collected for giventime intervals and aggregated for a longer time interval. Using thecollected data, vRB, vRBC, or another financial service can output costsincurred on VMs deployed in the environment.

The inventory data can be converted into the format file in stage 110 bya backend inventory data service. In one example, the format fileincludes the inventory data encoded in a self-describing language suchas XML, HTML, or JSON. During a conversion process, data elementscollected by a financial service and corresponding to data entityidentifiers, associations, and utilizations, can be assigned to specificobjects created within the format file by the inventory data service.Further, the inventory data service can assign specific objects to costspreviously computed by the financial service.

At stage 120, the method can include creating a tree structure (“tree”)of data entity nodes (“nodes”) from the format file. Further, nodesummaries for the nodes can be populated with corresponding inventorydata from the format file. In one example, the tree is a horizontal treethat can include a root node and one or more levels of descendant nodesto the right or the left of the root node. In another example, the treeis a vertical tree with levels of descendant nodes above or below theroot node.

Each level of the tree can include one or more nodes that correspond todata entities of a particular type. A node on one level can be a parentnode linked to a respective group of children nodes in a next level. Theparent node corresponds to a data entity that supports a group of dataentities, for example a data center that maintains a cluster of serverswithin an infrastructure.

The tree is a visual representation of the inventory and can be createdby applying the format file to a framework. In one example, theframework can include a library of pre-written scripts that can beutilized to produce a graphical representation of the inventory. In oneexample, the library can be a JavaScript library such as D3.js.Accordingly, the framework can produce the tree as a dynamic,interactive data visualization that is implemented in a web browser. Theformat file can be coded to a particular framework and includereferences to defined elements in a respective library. In applying theformat file, the framework can recognize the references and createobjects that correspond to data entities in the inventory. These objectscan be expressed as nodes. The framework can instantiate a node summaryfor each node created. Each node summary can be populated with inventorydata for a data entity that corresponds to a respective node associatedwith the node summary. The inventory data can be extracted from theformat file and used by the framework to populate the node summaries.

Stage 130 of the method can include displaying a first view of theinventory in a UI. The UI can receive the tree and render the first viewin a display of a computing device implementing the UI. The first viewcan include a hierarchical view and a first inventory summary. Thehierarchical view is a view of all or part of the tree and includes atleast a root node for a data entity at the highest level of a hierarchy.In one example, the hierarchical view displayed in stage 130 can includeone or more levels of descendant nodes. The number of levels displayedin an initial hierarchical view can be preset or set by a user of theUI. For each level displayed, all nodes for that level will be includedin the hierarchical view.

Further, links between levels will be included in the hierarchical viewto illustrate respective child-parent relationships for all of the nodesin the levels displayed. A link between a parent node and its childrennodes can have edges for each child node connecting it to the parentnode. The edges can be sized proportionally according to a value of onecomponent, for example total cost, for each of the children nodes.Accordingly, a user can quickly see which supported data entity has thehighest cost.

The first inventory summary can include a node summary for a nodedisplayed in the initial hierarchical view. In one example, the nodesummary is a node summary for the root node. In another example, thefirst inventory summary can include a node summary for another node thatis pre-selected by a user. The first inventory summary can include atleast one of cost and utilization data for a data entity for the nodeand be displayed in a review pane of the UI. Cost data can include atotal cost to maintain a data entity as well as one or more componentsof the total cost. In one example, the node summary can include thetotal cost for the data entity and a respective component cost formemory, labor, or licensing.

Utilization data may be included in the first inventory summary insteadof, or in addition to, the cost data. The utilization data can include apercent of an allocated resource that is being used by a particular dataentity. For example, a data entity may be allocated 1 GB of memory, butonly be using half of this memory capacity. The utilization data canalso include total allocations for the various resources that aretracked by the financial service.

At stage 140, the method can include receiving a selection of a nodedisplayed in the first view of the inventory. The selection can bereceived through a user device. The user device may include anycomputing device that is provided with a display and can receive inputfrom an operator, such as a tablet, phone, laptop, or computer.

According to an aspect of the present disclosure, one of two types ofnode selections can be received at stage 140. A first type can include anode being accessed in order to expand the node and display itsrespective children nodes. In one example, the node can be accessed bymoving a pointer over the node in a display and clicking on a mousedevice or entering a key on the keyboard. In another example, the nodecan be accessed by tapping a portion of a touch screen where the node isdisplayed. A second type of node selection can include polling a node bymouseover or otherwise causing a pointer to hover over the selectednode. This second node selection type can cause the UI to display arespective node summary adjacent to the selected node.

Stage 150 of the method can include displaying at least one of anupdated hierarchical view and a second inventory summary according to atype of node selection. An updated hierarchical view can be displayedwhen the first type of node selection type is performed on a node thatincludes children nodes. The updated hierarchical view can include thetree as previously displayed plus the children nodes of the selectednode. Further, a link between a level of the selected node and a levelof the children nodes can be displayed in the updated hierarchical view.Repeating the first node selection type for all nodes having childrenand being displayed in successive updated hierarchical views can causethe UI to reveal an entire tree.

A second inventory summary can be displayed when the second nodeselection type is performed on any of the nodes displayed in the firstview. As previously discussed, the first inventory summary includes adisplay of at least one node summary in a review pane of the UI. Thesecond inventory summary can include a node summary being displayedwithin the tree (“tree summary”) adjacent to the selected node. Inaddition, the second inventory summary can include the node summariesfor the selected node and its ancestors being displayed in the reviewpane. In one example, the second inventory summary can also include thenode summaries for each of the ancestor nodes being displayed inlocations adjacent to each of the ancestor nodes.

FIG. 2 illustrates example stages for visualizing an inventory of dataentities, showing interactions between various system components. Atstage 210, the UI can receive a selection of a management server forwhich cost or utilization information is desired. In one example, the UImay be associated with software with access to information frommanagement servers for one or more enterprises. In another example, theUI can be part of a package of tools associated with one managementserver and made available to an administrator for managing aninfrastructure of one enterprise. Any of these management servers canrun one or more VMWARE solutions, such as VSPHERE Client, VCENTERSERVER, and VREALIZE Suite.

In one example, one or more management servers can store identifying andoperational data regarding one or more servers necessary to supportMobile Device Management (“MDM”) and Enterprise Mobility Management(“EMM”) systems. The UI can be used by an administrator of an EMMprovider to log into multiple management servers which correspond todifferent enterprises that are clients of the EMM provider. In oneexample, such a user can select a particular management server at stage210.

In another example, the UI can be associated with software provided by amanagement server and used by an administrator of that managementserver. The operational data can be accessed from the management serverwhen the UI is initiated as part of stage 210. In yet another example,the UI may incorporate a sign-on protocol to restrict access to specificaccount holders such as administrators of specific enterprises. Accountscan be associated with one or more management servers across one or moreenterprises. The management server can be automatically selected basedon user sign-on.

At stage 212, the inventory data service can identify an inventory ofdata entities for the selected management server.

At stage 214, a backend can scan various management servers or a singlemanagement server associated with the UI for operational data includinginfrastructure hierarchy information, VM utilization data, and storageutilization data. In addition to scanning, in stage 214, the operationaldata can be processed by the financial service executing on the backendto calculate cost for each inventory of data entities managed by eachmanagement server. The backend can continuously scan the managementservers for the operational data and process the operational data.Together, the operational data and cost data define inventory data. Atstage 216, the inventory data service executing on the backend canobtain inventory data for the inventory identified in stage 212.

In some examples, at stage 217, the UI can receive selections for acomponent configuration, which controls what displays in a node summary.For example, the UI can prompt a user for what cost, performance,capacity, and utilization parameters will be displayed in a visualrepresentation of the inventory. Otherwise, a default configuration canbe used. In another example, stage 217 can precede stage 216, and theinventory data service can use the component configuration to limitretrieval of inventory data from the backend.

At stage 218, the inventory data service can convert the inventory datainto a format file. In one example, the inventory data service uses analgorithm to create groups of records from the raw inventory data. Eachgroup can correspond to a data entity that will be represented by a nodein a tree created from the format file. Records for each group caninclude components and values that will make up a node summary for arespective data entity. Each group can include the same set ofcomponents. The groups can be stored in the format file that is used togenerate the tree.

The inventory data may indicate which data entities support other dataentities. The algorithm can structure the groups within the format fileto reflect parent child relationships between the data entities. In oneexample, the algorithm can create the groups (i.e., nodes) in a bottomup manner. More specifically, the algorithm can create components andcomponent values for data entities in the lowest level of the treefirst, and work its way to the highest level, the root node. Anexemplary algorithm of this type can be illustrated with the followingpseudo code:

cost_of_private_cloud [management server] = 0 for each data_center inprivate_cloud:   cost_of_data_center = 0   for each cluster indata_center:     cost_of_cluster = 0     for each server in cluster:      cost_of_server = 0       for each vm in server:         cost_of_vm= findVmCostFromItsUtilization(vm)         makeRecord(cost_of_vm)        cost_of_server += cost_of_vm       makeRecord(cost_of_server)      cost_of_cluster += cost_of_server     makeRecord(cost_of_cluster)    cost_of_data_center += cost_of_cluster  makeRecord(cost_of_data_center)   cost_of_private_cloud +=cost_of_data_center makeRecord(cost_of_private_cloud)

The exemplary algorithm can produce groups corresponding to VMs,servers, clusters, data centers, and a management server, in that order.Each data entity type, as nested above, represents a level in ahierarchy of a respective infrastructure. In practice, the algorithm cancomplete all the groups on the VM-level first, and then proceed tocompleting all the groups in each successive level. Each group can haveone record corresponding to a component for total cost. Accordingly, atree deriving from the exemplary algorithm can include a tree of nodes,each node having a node summary including a total cost for data entityit represents.

In one example, the algorithm can calculate values of cost componentsbased on data entity type, which can correspond to a cost-driving levelin a tree for a particular cost component. The algorithm can use thecomponent value for a data entity at the cost driving level, tocalculate values for the component for data entities in higher or lowerlevels. In the algorithm above, a cost component is driven by a cost ofthe VMs which is obtained from the inventory data. Accordingly, a totalcost value for data entities other than VMs is calculated by thealgorithm according to a bottom up accrual method. A total cost for adata entity other than a VM can be a sum of total costs for dataentities it supports. In another example, a server level could drive ahardware cost. For every VM a server supports, the algorithm cancalculate a cost for hardware according to a top down distributionmethod. A hardware cost for a VM can be the hardware cost of the serverthat supports it, divided by a number of VMs the server supports. Incontrast, a hardware cost for a cluster can be calculated by the bottomup accrual method using the hardware costs of the servers it supports. Acost component may be driven on multiple levels and an algorithmaccording to the present disclosure can account for such cost flows.

In one example, the format file includes serial nested groups ofrecords. Each group may correspond to a data entity of the inventory andbe nested within a group for a respective parent data entity thatsupports the data entity of the nested group. Each group can includecomponent values for a cost, utilization, allocation, orperformance-related parameter that is tracked or computed by thefinancial or inventory data services. The components can include astatus of a data entity indicating if the data entity is active, idle,or has been removed. In another example, the components can includetotal cost and costs for CPU, memory, storage, labor, and licensing. Inone example, a parent node can have a status of a majority of itschildren nodes. Further, the components can include a cost flowcomponent for one or more of the cost components indicating whathierarchical level(s) drive particular costs. In one example, the formatfile generated is a JSON file. An example of a format file follows:

{ “total”: 229, “name”: “MS1”, “license”: 91, “status”: “active”,“storage”: 100, “vms”: 2, “children”: [      { “total”: 229,     “name”:“DC1”,     “license”: 91,     “license cost direction”: “down”,    “status”: “active”,     “storage”: 100,     “vms”: 2,    “children”: [          { “total”: 229,         “name”: “C1”,        “license”: 91,         “license cost direction”: “down”,        “status”: “active”,         “storage”: 100,         “vms”: 2,        “children”: [                { “total”: 229,              “name”: “S1”,               “license”: 91,              “license cost direction”: “down”,               “status”:“active”,               “storage”: 100,               “vms”: 2,              “children”: [                   { “name”: “VM1”,                 “license”: 45,                  “license costdirection”: “down”,                  “status”: “active”,                 “storage”: 49,                  “labor”: 20,                 “labor cost direction”: “up”,                 “memory”: 20,                  “total”: 123,                 “vms”: 1,                  “cpu”: 22 }                  { “name”: “VM2”,                  “license”: 46,                 “license cost direction”: “down”,                 “status”: “active”,                  “storage”: 51,                 “labor”: 20,                  “labor cost direction”:“up”,                  “memory”: 29,                  “total”: 126,                 “vms”: 1,                  “cpu”: 24 }                 ],             “memory”: 49,             “labor”: 40,            “labor cost direction”: “up”,             “cpu”: 46 }            ],         “memory”: 49,         “labor”: 40,         “laborcost direction”: “up”,         “cpu”: 46 }         ],     “memory”: 49,    “labor”: 40,     “labor cost direction”: “left”,     “cpu”: 46 }    ], “memory”: 49, “labor”: 40, “labor cost direction”: “down”, “cpu”:46 }

Values for the cost components can be computed by the financial orinventory data services. On the other hand, values associated with costflow components may be provided through the inventory data service andinclude designations that indicate a source of a particular costrelative to a given data entity. In one example, values for a cost flowcomponent can be pre-set in an algorithm for the inventory data servicefor specified levels of an infrastructure. In another example, theinventory data service may recognize how cost values are distributed oraccrued between levels of the infrastructure and set values of cost flowcomponents accordingly.

An infrastructure including VMs supported by servers grouped intoclusters can be used to illustrate a cost flow component. Licensingcosts may only be incurred on a VM-level, therefore a licensing cost fora server can be a sum of the licensing costs for the VMs it supports.The group of VMs occupy a “lower” hierarchical level than the servers,and the license cost for the supporting server can be described ascoming from the lower level. As a result, a licensing cost flowcomponent for the server may have a value in the format file of “down”or an arrow pointing down to indicate a respective cost is coming fromthe VMs.

At stage 220, the inventory data service can create a tree of nodes thatmodels a hierarchy of an infrastructure encompassing the inventory ofdata entities. The inventory data service can include a framework thatis developed on top of a library of pre-written scripts. The inventorydata service can apply the format file to the framework in stage 220 andcreate the tree as a graphical representation of the complete inventory.Each node of the tree can correspond to a data entity from theinventory. Further, the framework can graphically encapsulate variouscost drivers and cost components for the data entities in nodesummaries. A node summary can be associated with each node and includethe components in the format file. In addition, the node summary caninclude indicators for values of the cost flow components in the formatfile. The inventory data service can send the tree and node summaries tothe UI in stage 222.

At stage 224, a first view of the inventory can be configured from thetree and displayed in the UI. The UI can configure the first viewaccording to settings provided by a user through the UI or pre-set bythe data inventory data service. The first view includes thehierarchical view and the first inventory summary. In one example, thehierarchical view includes, at minimum, a portion of the tree includinga root node. The root node corresponds to data entity that manages theinventory of data entities represented by the tree. Depending on thenumber of levels of the hierarchy for the inventory, the root node maycorrespond to a server, a data cluster, a data center, or a managementserver. In one example the hierarchical view includes only the rootnode. In another example, a root node and one or more descendent nodesare displayed. In another example, the hierarchical view can include theroot node and all of the descendant nodes in each level for a pre-setnumber of levels.

In stage 226, the UI can receive the first node selection type to expanda selected node and display its children nodes. The selection can be aclick or double click on the node, in an example. In response to thefirst type of node selection, the UI can display information about dataentities supported by the selected node.

In stage 228, the inventory data service receives the node selectionfrom the UI and accesses a portion of the tree including the childrennodes of the selected node. In stage 230, the inventory data servicetransmits the portion of the tree including the children nodes andrespective node summaries to the UI for display. In stage 232, the UIinterface can display an updated hierarchical view of the inventory as aresult of receiving the portion of the tree. In another example, thefull tree is provided to the UI at stage 222, and the selection simplycauses the UI to access and display a different portion of the treewithout further assistance from the inventory data service.

The UI can expand a group of children nodes from the selected node. Thechildren nodes can expand to a different level than the selected node torepresent data entities directly supported by the data entity of theselected node. The level for the children nodes can be unpopulated, orinclude nodes corresponding to data entities supported by data entitieson the same level as the selected node. Repeating the first nodeselection type for all nodes having children and being displayed insuccessive updated hierarchical views can cause the UI to reveal anentire tree for the inventory. Thus, the inventory data service and theUI can provide a visual representation of the entire inventory thatmodels infrastructural relationships between all the data entities inthe inventory. In one example, execution of the first type of nodeselection can result in a change of the first inventory summary providedin the review pane. The review pane can be populated with node summariesfor the selected node and its ancestors.

In stage 234, the UI can receive the second type of node selection for anode displayed in the first view. In one example, the node selection canbe performed by hovering a pointer over a particular node. An identifierfor the selected node can be sent to the inventory data service at stage234. At stage 236, the inventory data service looks up the identifier inthe tree and retrieves or identifies a node summary for the selectednode, and node summaries for the selected node's ancestors. Informationincluding or identifying the node summaries is transmitted to the UI inat stage 238. In stage 240, the UI can display a second inventorysummary as a result of receiving the information from the inventory dataservice.

To this point in the sequence, the first inventory summary may have beendisplayed with the review pane of the UI. The first inventory summaryincludes the node summary for at least the root node provided in thereview pane of the UI. The second inventory summary can include nodesummaries for the selected node and each of its ancestors displayed inthe tree next to respective nodes (“tree summaries”). Each tree summarycan be a tooltip with component names and values for a data entity. Thereview pane can be populated with review pane summaries, which are nodesummaries for the same nodes in the second inventory summary.

A display of the second inventory summary can be illustrated withreference to an inventory including a management server, data centers,clusters, servers, and VMs. A first view of the inventory can include ahierarchical view that extends to the clusters. A cluster node can beselected via the second type of node selection. Tree summaries for theselected cluster node, a node for a data center that supports thecluster, and the root node can be displayed in the tree in the UI. Thereview pane can include node summaries for these same nodes. In oneexample, hovering a cursor over the data center node for the clustercauses removal of the tree and review pane summaries for the clusternode. If a different data center node is selected, stages 234 to 240 canbe performed for the newly selected node. A first sub-process includingstages 226 to 232 can be performed before or after a second sub-processincluding stages 234 to 240. These sub-processes can be performedrepeatedly in various orders.

FIG. 3 provides a detailed sequence diagram for using a UI to search fora data entity and obtain respective cost or utilization data. In stage312, a search query for a data entity can be received through the UI.The UI can include a text field where the search query can be entered.In one example, identifiers (“IDs”) for each data entity included in theinventory data can be assigned by a management server or the inventorydata service according to a pre-defined naming convention or namedindividually by an administrator. The search query can include an exactor partial match to IDs in the inventory. At stage 314, the inventorydata service can compare the search query to a list of IDs for the dataentities in an inventory to find a match or partial matches. Theinventory data service can identify the data entity or data entitiesthat include input for the search query in their IDs and send the searchresults to the UI in stage 316.

At stage 318, the UI displays the selectable search results. In oneexample, each search result can be displayed as a string of IDs thatincludes the ID or partial ID of the searched-for data entity, and theIDs of respective supporting data entities. The IDs can be arranged inreverse ancestral order with the ID or partial ID of the searched-forentity at the beginning of the string. Each search result can beselected by a user of the UI. In one example, the IDs can include a dataentity type and a number. The number can correspond to a number in anorder in which the data entity was added to the inventory or assigned anID by the inventory data service.

A search query that includes a data type and a number can result in theinventory data service returning a single search result. In anotherexample, the number in the search query could equate to a truncation ofa number in multiple IDs, and multiple search results can be returned.In addition, the inventory data service can recognize a correspondencebetween names of data entity types and known or preset abbreviations. Asa result, a search query including only a name or abbreviation for aparticular data entity type could be a partial match for several dataentity IDs. For example, a search query for “S 21”, “server 21”, or “ser21” can result in a selectable search result expressed as “Server 21 ---Cluster 4 --- Data Center 2 --- Management Server 1” or “S21 --- C4 ---DC2 --- MS1.” On the other hand, a search query for “server 2” can yielda list of search results each including “Server 2_” where “_” is blankor a number 0 to 9.

At stage 320, the UI receives a selection of a search result, which istransmitted to the inventory data service. At stage 322, the inventorydata service accesses a portion of the tree including the data entityfor the selected search result. At stage 324, the inventory data servicesends an isolated portion of the tree including the selected data entityto the UI. The isolated portion of the tree includes a node for theselected data entity and its respective ancestor nodes.

Stage 326 can include the UI displaying a second view of the inventoryincluding an isolated view of the tree and the first inventory summary.The isolated view can include a single line of linked nodes includingthe root node at one end and a node for the selected data entity at anopposite end (end node). The nodes can be arranged according to theancestral (parent-child) order for their corresponding data entities.The first inventory summary can include node summaries in the reviewpane for each of the nodes displayed in the isolated view.

At stage 328, a node selection of the first or second type can bereceived by the UI and information regarding the selected node and thenode selection type can be transmitted to the inventory data service. Atstage 330, the inventory data service can process the node selectiontype and determine what additional details from the tree can or need tobe provided. In response the first selection type, the inventory dataservice can determine if the selected node is an end node and is aparent to other data entities. In response to the second selection type,the inventory data service can determine whether additional detail fromthe tree is or is not required.

At stage 332, the inventory data service can transmit additional detailswith respect to the tree and the UI can display an updated second viewin stage 334. Where the selected node has children nodes and was the endnode, the additional details can include a portion of the tree includingchildren nodes. The UI can expand the selected node and display thechildren nodes. Each of the children nodes that includes children nodescan be expanded through a subsequent first type of node selection. Ifthe selected node is not the end node or has no children nodes, theadditional details can include a message that the node cannot beexpanded.

In another example, the second node selection type can be performed onthe end node, or any other of the nodes displayed in the second view.The additional details transmitted in stage 332 can be an instruction todisplay the second inventory summary. As a result, UI can display thetree summaries for the selected node and any respective ancestor nodesin stage 334. In addition, where the selected node is not the end nodethe review pane can be updated to include just the node summaries of theselected node and its ancestor nodes.

In another example, the UI receives a full tree from the inventory dataservice. The UI can then display and hide portions of the tree based onuser selections rather than re-querying the inventory data service basedon each UI selection. In still another example, the inventory dataservice provides a partial tree that includes more information than iscurrently displayed at the UI. The UI can expand the tree until itreaches a portion where more information is needed, at which time it canquery the inventory data service.

FIG. 4 provides an illustration of an example system for performing themethods of FIGS. 1-4. The system can include one or more managementservers 400 that can each provide centralized management of andoperational data gathering from a respective infrastructure of dataentities. Each management server 400 can be a single server or a networkof servers. Each management server 400 can utilize one or moreprocessors and memory stores. Each management server 400 can provide anadministrator with tools to manage an infrastructure. For example, anyof the management servers 400 can run one or more VMWARE solutions, suchas VSPHERE Client, VCENTER SERVER, and VREALIZE Suite.

Each management server 400 can store various types of operationalinformation associated with data entities it manages. Operationalinformation that can be stored can include names and locations of dataentities, physical hardware, current and historical loads, installedsoftware, the number of VMs running on each data entity, OS type, OSlicense type, other physical or virtual components, and hierarchicalpositions within an infrastructure.

The system of FIG. 4 can include a system backend 410. The systembackend 410 can be one or more servers that execute a financial service420 and an inventory data service 430. The financial service 420 and theinventory data service 430 can be part of a software product that is atleast partially provided by the backend. The software product canprovide data center management tools, optimization and analysis tools,workload cost comparison, consumption tracking and analysis, and anyother relevant features. In some examples, the software including thefinancial service 420 and the inventory data service 430 can provideoptimization and analysis tools such as cloud cost tracking, current andplanned workload cost comparison, and consumption tracking and analysisacross business groups, applications, and services.

In addition to the financial service 420 and the inventory data service430, the backend 410 can provide a user interface 440 associated withthe system. The user interface 440 is at least associated with theinventory data service 430 and configured to provide a visualrepresentation of any of the inventories managed by the managementservers 400. In one example, the user interface 440 can be associatedwith the financial service 420 in addition to the inventory data service430. An example software product for the financial service 420associated with the user interface 440 is VMWARE's VREALIZE Business forCloud, although any other suitable software can be used. An example userinterface 440 is provided in FIGS. 5A-8B.

FIGS. 5A and 5B provide illustrations of an exemplary UI 500 displayinga first view 502 of an infrastructures inventory of data entities.Turning to FIG. 5A, the first view 502 of the UI 500 includes ahierarchical view 510 of the inventory and a first inventory summary520. The hierarchical view 510 includes a portion of a tree 512constructed for the inventory including a root node 514. Each node ofthe tree 512 that is displayed in the hierarchical view 510 can includean ID 516 and a status indicator 518. The ID 516 corresponds to a nameor other identifier assigned to a data entity for a given node. Thestatus indicator 518 indicates whether the data entity is active, idle,or has been deleted from the inventory. In one example, a legend 517 canbe provided in the UI 500 that defines an indicator for each status. Aportion of the tree 512 provided with the hierarchical view 510 caninclude one or more levels of an infrastructure. In FIG. 5A, a singlenode 519, representing a single level of an infrastructure, isdisplayed. The node 519 is the root node 514 for the tree 512 as itcorresponds to a management server 400 (“MS1”) of FIG. 4. As previouslynoted, when the UI 500 is accessed a particular management server 400can be selected for display depending on administrative permissionsgranted to a particular user of the UI 500. The number of levelsdisplayed in the first view 502 can be adjusted by a user in apreferences module of the UI 500.

The first inventory summary 520 is displayed in a review pane 522 in theUI 500. The review pane 522 can include a review pane version of a nodesummary (“review pane summary 524”) for nodes currently displayed in theUI 500. Each review pane summary 524 can include a componentconfiguration 526 that displays tracked parameters for data entities inthe inventory. The component configuration 526 can include statisticalcomponents 530 and cost flow components 540.

The statistical components 530 can include some combination of cost,performance, utilization, or other parameter tracked by the financialservice 410. As shown in FIG. 5A, the statistical components 530 caninclude several performance components 532 that inform on the status andnumber of VMs managed by a data entity. The statistical components 530further include cost components 534 such a total cost for the dataentity, and sub-costs such as labor and license costs. One or more ofthe cost components 534 can be accompanied by one of the cost flowcomponents 540.

For example, labor and license flow components 542, 544 can berepresented by an arrow that points up, down, or towards a respectivecost component. In FIG. 5A, the labor and license flow components 542,544 are both down arrows indicating these costs originate from one ormore data entities on a lower level of a hierarchy. In this way, thefirst view 502 provides a user with a visual representation for thesource of different costs within an infrastructure.

Nodes such as the root node 514 can be selected in one or more ways witha pointer 560. In FIG. 5B, the first view 502 of the inventory isdisplayed after the root node 514 has been selected according to a firsttype of node selection. An updated hierarchical view 510 of the tree 512is displayed along with the first inventory summary 520. Children nodes562 have been expanded in the tree 512 from the root node 514 andcorrespond to data center data entities that are directly supported andmanaged by the Management Server MS1. Accordingly, two levels of thetree 512 are now displayed.

A link 570 is provided between the root node 514 and the children nodes562. The link 570 can include a trunk portion 572 and edges 574. Eachchild node 562 can be linked to the trunk 572 by a respective edge 574.Edges 574 for a given link can be different in appearance to reflect adifference in values within a group of children nodes for a parameterincluded as a component in the node summaries. As illustrated in FIG.5B, edge 574A links data entity DC1 to the trunk 572 and has a thicknessthat is greater than a thickness of edge 574B, which links data entityDC4 to the trunk. In one example, the difference in thickness canreflect that data entity DC1 has a higher total cost than data entityDC4.

The first inventory view 520 is also included in the UI 500 illustratedin FIG. 5B. In particular, the review pane 522 includes the node summary524 for the root node 514. In one example, the review pane 522 continuesto display a node summary for a node that has been selected by firstnode selection type since that node has in fact been selected. Inanother example, the first inventory summary 520 can be updated show anode summary for children node 562 meeting criteria for cost or resourceutilization set by an administrator.

FIGS. 6A and 6B provide illustrations of the exemplary UI 500 displayinga second inventory summary within the first view 510 of the inventory.In FIG. 6A, the tree 512 has been expanded to display several parentchild relationships and the five levels of the infrastructure managed byManagement Server MS1. The first level 610 includes the ManagementServer MS1, the second level 612 includes data centers, the third level614 includes clusters, the fourth level 616 includes servers, and thefifth level 618 includes VMs. The portion of the tree 512 displayed inthe hierarchical view 510 illustrated in FIG. 6A can be provided througha series of node selections of the first type.

However, the first view 502 of FIG. 6A illustrates the result ofselecting a node according to the second type of node selection. Inparticular, the pointer 560 is shown hovering over a node 620 for aServer S31. In response, a second inventory summary 630 is displayed inthe UI 500. The second inventory summary 630 includes review panesummaries 534 and tree summaries 632 for the node 620 selected and itsancestor nodes corresponding to Cluster C7, Data Center D4, andManagement Server MS1.

The second inventory view 630 provides a user with the ability to view anode summary for one data entity in isolation with the tree summaries632. Additionally, the user can use the review pane 522 to view a nodesummary for a selected data entity in the context of a line ofsupporting and supported data entities. Accordingly, the user can gleanhow one data entity contributes to a tracked parameter for a supportingentity in a single look at the review pane 522.

In one example, the tree summaries 632 can include the same componentconfiguration as the review pane summaries 524, with the exception of aname or ID for a data entity. In another example, componentconfigurations for the review pane and tree summaries 524, 632 can bedifferent as configured by a user of the UI 500.

As shown FIG. 6A, all of the node summaries include cost flow componentsfor labor and license cost components. Being able to see cost flowcomponent for each data entity in a line of data entities allows a userto identify the hierarchical level in an infrastructure from which aparticular cost is driven. With respect to labor cost, a labor flowcomponent 640 for the Management Server MS1 points downward. In oneexample, this can mean that labor cost originates from a level in theinfrastructure with data entities supported by the Management ServerMS1. Another way to say this is the cost originates a lower level and ispushed up to Management Server MS1. In terms of distribution of cost,the down arrow indicates that a bottom up accrual method is used todetermine the labor cost for the Management Server MS1 and is equal to asum of labor costs of the data entities it immediately supports, thedata centers.

On the other hand, the labor flow components 642, 644 for the Server S31and Cluster C7 point upwards in FIG. 6A, meaning the source of this costrelative to those data entities originates from a higher level in theinfrastructure and is pushed down. In terms of distribution of cost, theup arrow means a top down distribution method is used to determine thelabor cost for these data entities. As such, the labor cost for ServerS31 is equal to the labor cost of its parent, Cluster C7, divided by thenumber servers that Cluster C7 supports. In contrast, a labor flowcomponent 646 for Data Center D4 points toward the labor cost value.Accordingly, the tree and review pane summaries 524, 632 indicates alabor cost for Data Center D4 originates at this data entity. Further,the combination of values for the cost flow components 640-646 indicatesData Center D4 is the source of cost for this component for theManagement Server MS1 that supports it, as well as Cluster C7 and Server31 which it supports.

Turning to FIG. 6B, the pointer 560 has been moved and is now shown ashovering over a node 670 for virtual machine VM151. In response, the UI500 has updated the second inventory view 630 so that a tree summary 632is displayed next to the node for VM151, and a review pane summary 524for VM151 is included in the review pane 522. The review pane 522therefore displays the node summary for VM151 and the node summaries ofits ancestors. Like the review pane summary for Server 31 in FIG. 6A,the review pane summary 524 for VM151 is positioned in a first position650 in the review pane 522. In one example, a node summary for the firstposition 650 in the review pane 522 can be a node summary for whichevernode was most recently selected through the first or second selectiontype.

As shown in FIG. 6B, a status indicator 682 for a node 680 for server S1indicates the data entity is idle. Further, a group of nodes 684 for thechildren of node 680 indicate that data entities VM1, VM2, and VM4 areidle, data entity VM3 is active, and data entity VM5 has been deleted.In one example, the inventory data service 430 can determine the statusof a data entity according to the status of the data entities itsupports, if any. In one example, a status of a data entity thatsupports other data entities can be set by the inventory data service orthe UI. The status can be derived based on a majority of the supporteddata entities. As is the case for server S1, a majority of the VMs itsupports have an idle status resulting in its status indicator 682showing Server S1 as being idle. In one example, the user can expand thetree 512 beneath Server S1 to see statuses for individual VMs.

In another example, the status indicator for any data entity thatsupports other data entities can be set to active if even one supporteddata entity is active. Further, if no supported data entities areactive, the status for the supporting data entity can be set to eitheridle or deleted based on a status of a majority of supported dataentities. In yet another example, a status indicator for a supportingdata entity can be set to deleted only where all the data entities ithad been supporting were deleted.

FIG. 7 provides an illustration of the exemplary UI 500 in which adirected entity search has been executed, and a searched for entity andits ancestors are displayed. The UI 500 can include a search field 700in which an ID or partial ID for a data entity can be entered. In thecase of FIG. 7, a search query for “VM103” has been entered. Unless aninventory visualized in the UI 500 includes more than one server with anID that includes 103, this type of search query can return a singleresult. In another example, a search query can include quotation marksor other characters that can limit a search to a single data entity.

As shown in FIG. 7, the UI 500 has displayed a second view 710 of theinventory including an isolated view 712 of the tree 512 and the firstinventory summary 520 in the review pane 522. The isolated view 712includes a node 713 for the searched-for data entity as an end node 714,its intermediate ancestor nodes 716, and the root node 514. Morespecifically, an initial isolated view 710 is a line of nodes that onlyincludes parent-child relationships that link a node for thesearched-for data entity to a root node of a tree for the inventory.

In one example, the first inventory summary 520 in the second view 710includes a review pane summary 632 for the searched-for entity in thefirst position 650 in the review pane 522. Review pane summaries for thesupporting data entities can also be displayed as shown in FIG. 7.However, if the second type of node selection is used to select one ofthe nodes in the isolated view 712 that is not the end node 714, the UI500 can display the second inventory summary 620 and change the reviewpane 522. More specifically, tree summaries for the selected node andits ancestor nodes can be displayed, and the review pane summary for theselected node can be displayed in the first position 650.

FIG. 7 illustrates an isolated view for a VM which occupies a finallevel of the infrastructure hierarchy of the displayed inventory.However, data entities in higher levels of a hierarchy can be searchedfor and displayed. Nodes for such data entities can be selected in theisolated view 712 according to the first and second type of nodeselections and result in the same display updates by the UI 500described with respect to FIGS. 5B and 6B.

FIGS. 8A and 8B provide illustrations of the exemplary UI 500 before andafter execution of a menu-based entity search. Turning to FIG. 8A, thefirst view 510 of the inventory is displayed and a search query 800 isentered in the search field 700. In one example, the inventory dataservice 420 has compared the search query to a list of IDs for the treeand determined there is a match and several partial matches between theIDs and the search query. As a result, the inventory data service 420has returned the search results to the UI 500. FIG. 8A illustrates aresponse of the UI 500 to receiving the search results, which includesdisplaying a list 810 of search results 812 below the search field 700.Each search result 812 can include the ID of the matching or partiallymatching node at the beginning of a string 814. The string can furtherinclude the IDs of the ancestor nodes for the node at the beginning ofthe string 814. Any of the search results 812 can be selected by a userthrough the UI 500.

Turning to FIG. 8B, the second view 710 is displayed in the UI 500. Thesearch field 700 includes an ID for a data entity for a selected dataentity 820. The second view 710 includes the isolated view 712 for theselected data entity 820, and the first inventory summary 520. A reviewpane summary 524 for the selected data entity 820 is displayed in thefirst position 650 of the review pane 522. In the isolated view 710, anode 824 for the selected data entity 820 is displayed as the end node714 in a string that can include intermediate ancestor nodes 716 and theroot node 512.

As illustrated in FIG. 8B, the menu-based search can return an isolatedview for a data entity that is not part of a lowest level of theinfrastructure's hierarchy. As is the case for the directed search, thenode 824 can be selected according to the first type of node selection.Thus, children nodes, if there be any, for data entities supported bythe selected data entity 820, can subsequently expand from the node 824.

Other examples of the disclosure will be apparent to those skilled inthe art from consideration of the specification and practice of theexamples disclosed herein. Though some of the described methods havebeen presented as a series of steps, it should be appreciated that oneor more steps can occur simultaneously, in an overlapping fashion, or ina different order. The order of steps presented is only illustrative ofthe possibilities and those steps can be executed or performed in anysuitable fashion. Moreover, the various features of the examplesdescribed here are not mutually exclusive. Rather any feature of anyexample described here can be incorporated into any other suitableexample. It is intended that the specification and examples beconsidered as exemplary only, with a true scope and spirit of thedisclosure being indicated by the following claims.

What is claimed is:
 1. A method for visualizing an infrastructure of acomputing system, comprising: converting cost and utilization data fordata entities of the infrastructure into a format file; from the formatfile, creating a tree structure of nodes that correspond to the dataentities; from the format file, populating node summaries thatcorrespond to the data entities with associated cost and utilizationdata; displaying in a user interface, a first view of theinfrastructure, including: a hierarchical view of the tree structure;and a first node summary including at least one of cost and utilizationdata for a first data entity; receiving a selection of a first nodecorresponding to the first data entity and displayed in the hierarchicalview; and displaying at least one of an updated hierarchical view and asecond node summary, according to a node selection type, wherein thefirst node summary is displayed in a review pane of the user interface,wherein the first node summary includes cost values for cost componentsincluded in the format file for the first data entity, the costcomponents including a total cost and at least one sub-cost associatedwith the first data entity, and wherein the cost values for the costcomponents are determined by summing values for data entities supportedby the first data entity.
 2. The method of claim 1, wherein the treestructure defines an arrangement of nodes corresponding to a hierarchyof corresponding data entities within the infrastructure, wherein thehierarchical view includes a first portion of the tree structureincluding the first node and the updated hierarchical view includes asecond portion of the tree structure different than the first portion,wherein the second portion includes children nodes expanded from thefirst node, and wherein the children nodes correspond to data entitiessupported by the first data entity.
 3. The method of claim 1, whereinreceiving the selection includes receiving a first selection type foraccessing nodes, and wherein the user interface displays the updatedhierarchical view in response to receiving the first selection type. 4.The method of claim 1, wherein displaying the second node summarycomprises the stages of: displaying the second node summary in alocation adjacent to the first node; displaying node summaries forancestor nodes of the first node, the ancestor nodes corresponding todata entities that support the first data entity; and displaying thesecond node summary and the node summaries additionally in the reviewpane.
 5. The method of claim 1, wherein receiving the selection includesreceiving a second selection type based on hovering over the first node,and wherein the user interface displays the updated hierarchical view inresponse to receiving the second selection type.
 6. The method of claim1, wherein the first node summary includes a cost flow component with anindicator pointing in a direction, wherein the direction indicates thecost components are one of pushed down from a supporting data entity,pushed up from a supported data entity, and originating from the firstdata entity.
 7. The method of claim 1, further comprising the stages of:receiving a search query in a search field of the user interface;comparing the search query to a list of identifiers for the dataentities of the infrastructure; displaying at least one identifier thatis one of a match and a partial match in a list of search results to thesearch query; receiving a selection of the one of the search results;and displaying a second view of the infrastructure including an isolatedview of the tree structure, wherein the isolated view includes a secondnode, for a second data entity corresponding to the selected searchresult, displayed as an end node extending from ancestor nodes.
 8. Anon-transitory, computer-readable medium comprising instructions that,when executed by a processor, perform stages for visualizing aninfrastructure of a computing system, the stages comprising: convertingcost and utilization data for data entities of the infrastructure into aformat file; from the format file, creating a tree structure of nodesthat correspond to the data entities; from the format file, populatingnode summaries that correspond to the data entities with associated costand utilization data; displaying in a user interface, a first view ofthe infrastructure, including: a hierarchical view of the treestructure; and a first node summary including at least one of cost andutilization data for a first data entity; receiving a selection of afirst node corresponding to the first data entity and displayed in thehierarchical view; and displaying at least one of an updatedhierarchical view and a second node summary, according to a nodeselection type, wherein the first node summary is displayed in a reviewpane of the user interface, wherein the first node summary includes costvalues for cost components included in the format file for the firstdata entity, the cost components including a total cost and at least onesub-cost associated with the first data entity, and wherein the costvalues for the cost components are determined by summing values for dataentities supported by the first data entity.
 9. The non-transitory,computer-readable medium of claim 8, wherein the tree structure definesan arrangement of nodes corresponding to a hierarchy of correspondingdata entities within the infrastructure, wherein the hierarchical viewincludes a first portion of the tree structure including the first nodeand the updated hierarchical view includes a second portion of the treestructure different than the first portion, wherein the second portionincludes children nodes expanded from the first node, and wherein thechildren nodes correspond to data entities supported by the first dataentity.
 10. The non-transitory, computer-readable medium of claim 8,wherein displaying the second node summary comprises the stages of:displaying the second node summary in a location adjacent to the thefirst node; displaying node summaries for ancestor nodes of the firstnode, the ancestor nodes corresponding to data entities that support thefirst data entity; and displaying the second node summary and the nodesummaries additionally in the review pane.
 11. The non-transitory,computer-readable medium of claim 8, wherein the first node summaryincludes a cost flow component with an indicator pointing in adirection, wherein the direction indicates the cost components are oneof pushed down from a supporting data entity, pushed up from a supporteddata entity, and originating from the first data entity.
 12. Thenon-transitory, computer-readable medium of claim 8, the stages furthercomprising: receiving a search query in a search field of the userinterface; comparing the search query to a list of identifiers for thedata entities of the infrastructure; displaying at least one identifierthat is one of a match and a partial match in a list of search resultsto the search query; receiving a selection of the one of the searchresults; and displaying a second view of the infrastructure including anisolated view of the tree structure; wherein the isolated view includesa second node, for a second data entity corresponding to the selectedsearch result, displayed as an end node extending from ancestor nodes.13. A system for visualizing infrastructure of a computing system,comprising: a memory storage including a non-transitory,computer-readable medium comprising instructions; and a backendincluding a processor that executes the instructions to carry out stagescomprising: converting cost and utilization data for data entities ofthe infrastructure into a format file; from the format file, creating atree structure of nodes that correspond to the data entities; from theformat file, populating node summaries that correspond to the dataentities with associated cost and utilization data; displaying in a userinterface, a first view of the infrastructure, including: a hierarchicalview of the tree structure; and a first node summary including at leastone of cost and utilization data for a first data entity; receiving aselection of a first node corresponding to the first data entity anddisplayed in the hierarchical view; and displaying at least one of anupdated hierarchical view and a second node summary, according to a nodeselection type, wherein the first node summary is displayed in a reviewpane of the user interface, wherein the first node summary includes costvalues for cost components included in the format file for the firstdata entity, the cost components including a total cost and at least onesub-cost associated with the first data entity, and wherein the costvalues for the cost components are determined by summing values for dataentities supported by the first data entity.
 14. The system of claim 13,wherein the tree structure defines an arrangement of nodes correspondingto a hierarchy of corresponding data entities within the infrastructure,wherein the hierarchical view includes a first portion of the treestructure including the first node and the updated hierarchical viewincludes a second portion of the tree structure different than the firstportion, wherein the second portion includes children nodes expandedfrom the first node, and wherein the children nodes correspond to dataentities supported by the first data entity.
 15. The system of claim 13,wherein displaying the second inventory summary comprises the stages of:displaying the second node summary in a location adjacent to the firstnode; displaying node summaries for ancestor nodes of the first node,the ancestor nodes corresponding to data entities that support the firstdata entity; and displaying the second node summary and the nodesummaries additionally in the review pane.
 16. The system of claim 13,wherein the first node summary includes a cost flow component with anindicator pointing in a direction, wherein the direction indicates thecost components are one of pushed down from a supporting data entity,pushed up from a supported data entity, and originating from the firstdata entity.
 17. The system of claim 13, the stages further comprising:receiving a search query in a search field of the user interface;comparing the search query to a list of identifiers for the dataentities of the infrastructure; displaying at least one identifier thatis one of a match and a partial match in a list of search results to thesearch query; receiving a selection of the one of the search results;and displaying a second view of the infrastructure including an isolatedview of the tree structure; wherein the isolated view includes a secondnode, for a second data entity corresponding to the selected searchresult, displayed as an end node extending from ancestor nodes.